Asynchronous Consensus: A Model in TLA+
نویسنده
چکیده
The main goal of this project was to learn the TLA+ specification language and to start exploring the practical limitations of modeling and simulating unreliable systems. A TLA+ specification for a naive asynchronous consensus protocol is presented along with the model-checking times for one to eight processes under crash-free conditions. Model-Checking times increase drastically with added processes, making large-scale model-checking intractable without further model abstraction. The protocol is broken by adding a crash action, and preliminary analysis of failure detector modeling is given.
منابع مشابه
On the Logic of TLA+
TLA+ is a language intended for the high-level specification of reactive, distributed, and in particular asynchronous systems. Combining the linear-time temporal logic TLA and classical set-theory, it provides an expressive specification formalism and supports assertional verification.
متن کاملON THE LOGIC OF TLA + Stephan Merz
TLA+ is a language intended for the high-level specification of reactive, distributed, and in particular asynchronous systems. Combining the linear-time temporal logic TLA and classical set-theory, it provides an expressive specification formalism and supports assertional verification.
متن کاملA Theory of Distributed Systems
The theory θ presented here is the smallest theory in the temporal logic TLB [10] that all distributed systems, according to our definition of a distributed system, must satisfy. θ is an instance of the classical modal logic S4.2. The central theorems of θ are stated here without proof. Proofs will appear in [10]. Logics like TLA [14] and TLRCS [18] are used for specifying computer programs and...
متن کاملMechanized Refinement of Communication Models with TLA ^+ +
In distributed systems, asynchronous communication is often viewed as a whole whereas there are actually many di erent interaction protocols whose properties are involved in the compatibility of peer compositions. A hierarchy of asynchronous communication models, based on re nements, is established and proven with the TLA Proof System. The work serves as a rst step in the study of the substitua...
متن کاملTowards Verification of the Pastry Protocol Using TLA +
Pastry is an algorithm that provides a scalable distributed hash table over an underlying P2P network. Several implementations of Pastry are available and have been applied in practice, but no attempt has so far been made to formally describe the algorithm or to verify its properties. Since Pastry combines rather complex data structures, asynchronous communication, concurrency, resilience to ch...
متن کامل